Karhunen–Loéve Expansion of a Set of Rotated Templates
نویسندگان
چکیده
In this paper, we propose a novel method for efficiently calculating the eigenvectors of uniformly rotated images of a set of templates. As we show, the images can be optimally approximated by a linear series of eigenvectors which can be calculated without actually decomposing the sample covariance matrix.
منابع مشابه
Computational Modeling of Turbulent Velocity Structures for an Open Channel Flow Using Karhunen–loéve Expansion
This paper develops an analytical two-part covariance kernel from velocity correlations across a two-dimensional (vertical and flow directions) Particle Image Velocimetry (PIV) flow field. This will form the basis of a model of wave action in flood water that includes the underlying turbulence velocity field using Karhunen–Loéve (KL) expansion. The PIV data was from the supercritical flow area ...
متن کاملStochastic analysis of an elastic 3D half-space respond to random boundary displacements: exact results and Karhunen-Loéve expansion
A stochastic response of an elastic 3D half-space to random displacement excitations on the boundary plane is studied. We derive exact results for the case of white noise excitations which are then used to give convolution representations for the case of general finite correlation length fluctuations of displacements prescribed on the boundary. Solutions to this elasticity problem are random fi...
متن کاملOptimal approximation of uniformly rotated images: relationship between Karhunen-Loeve expansion and discrete cosine transform
We present the concept that for uniformly rotated images, the optimal approximation of the images can be obtained by computing the basis vectors for the discrete cosine transform (DCT) of the original image in polar coordinates, and that the images can be represented as linear combinations of the basis vectors.
متن کاملModel Reduction, Centering, and the Karhunen-Loeve Expansion
We propose a new computationally efficient modeling method that captures existing translation symmetry in a system. To obtain a low order approximate system of ODEs prior to performing Karhunen Loeve expansion we process the available data set using a “centering” procedure. This approach has been shown to be efficient in nonlinear scalar wave equations.
متن کاملUse of Fourier and Karhunen-Loeve Decomposition for Fast Pattern Matching With a Large Set of Templates
We present a fast pattern matching algorithm with a large set of templates. The algorithm is based on the typical template matching speeded up by the dual decomposition; the Fourier transform and the Karhunen-Loeve transform. The proposed algorithm is appropriate for the search of an object with unknown distortion within a short period. Patterns with different distortion differ slightly from ea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001